package 二分查找;

public class 搜索插入位置4 {
    //https://leetcode.cn/problems/search-insert-position/
    public int searchInsert(int[] nums, int target) {
        int left = 0, right = nums.length - 1;
        while(left < right) {
            int mid = left + (right - left) / 2;
            if(nums[mid] < target) left = mid + 1;
            else right = mid;
        }
        if(nums[left] < target) return left + 1; // 二分一定在区域内找到，结果在非数组区域的
        return left;
    }
}
